Real-Time Job Scheduling in Hypercube Systemsy
نویسندگان
چکیده
O-Hoon Kwon*, Jong Kim*, SungJe Hong*, and Sunggu Lee** *Dept. of Computer Science and Engineering **Dept. of Electronic and Electrical Engineering Pohang University of Science and Technology San 31 Hyoja Dong, Pohang 790-784, KOREA Phone : +(82)-562-279-2257, Fax : +(82)-562-279-2299 E-mail : [email protected] Abstract As application areas that have real-time requirements become diverse and parallel processing becomes practical, advanced real-time systems are faced with the need for utilizing high-performance parallel processing systems. Moreover, hard real-time systems need sophisticated scheduling algorithms to decide the sequence of job execution, so that each job can be executed without violating its timing restriction. In this paper, we present the problem of scheduling real-time jobs in a hypercube system and propose a scheduling algorithm. The goals of the proposed scheduling algorithm are to determine whether all jobs can complete their processing before their xed deadlines in a hypercube system and to nd such a schedule. All jobs are considered to be aperiodic, independent, nonpreemptable, and ready to start execution at the time of invocation of the scheduling algorithm. Also, each job requests a subcube for the execution of its job and the processors requested by the job are used throughout the job's execution time. Hence, associated with each job is a computation time, a deadline, and a dimensional requirement. We show that determining a schedule such that all jobs meet before their respective xed deadlines in a hypercube system when preemption is not allowed is an NP-complete problem. We thus present a heuristic scheduling algorithm for scheduling non-preemptable real-time jobs in a hypercube system. Finally, we evaluate the proposed algorithm using simulation.
منابع مشابه
Bi-criteria Three Stage Fuzzy Flowshop Scheduling with Transportation Time and Job Block Criteria
Scheduling is an enduring process where the existence of real time information frequently forces the review and modification of pre-established schedules. The real world is complex and complexity generally arises from uncertainty. From this prospective the concept of fuzziness is introduced in the field of scheduling. The present paper pertains to a bi-criterion in n-jobs, three machines fl...
متن کاملAn Efficient Bi-objective Genetic Algorithm for the Single Batch-Processing Machine Scheduling Problem with Sequence Dependent Family Setup Time and Non-identical Job Sizes
This paper considers the problem of minimizing make-span and maximum tardiness simultaneously for scheduling jobs under non-identical job sizes, dynamic job arrivals, incompatible job families,and sequence-dependentfamily setup time on the single batch- processor, where split size of jobs is allowed between batches. At first, a new Mixed Integer Linear Programming (MILP) model is proposed for t...
متن کاملA Lazy Scheduling Scheme for Hypercube Computers
Processor allocation and job scheduling are two complementary techniques for improving the performance of multiprocessors. It has been observed that all the hypercube allocation policies with the FCFS scheduling provide only incremental performance improvement. A greater impact on the performance can be obtained by eecient job scheduling. This paper presents an eeort in that direction by introd...
متن کاملA New Approach in Job Shop Scheduling: Overlapping Operation
In this paper, a new approach to overlapping operations in job shop scheduling is presented. In many job shops, a customer demand can be met in more than one way for each job, where demand determines the quantity of each finished job ordered by a customer. In each job, embedded operations can be performed due to overlapping considerations in which each operation may be overlapped with the other...
متن کاملOptimality of the flexible job shop scheduling system based on Gravitational Search Algorithm
The Flexible Job Shop Scheduling Problem (FJSP) is one of the most general and difficult of all traditional scheduling problems. The Flexible Job Shop Problem (FJSP) is an extension of the classical job shop scheduling problem which allows an operation to be processed by any machine from a given set. The problem is to assign each operation to a machine and to order the operations on the machine...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1997